554B - Ohana Cleans Up - CodeForces Solution


brute force greedy strings *1200

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
int main(){
  ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(0);
   int n,a[100]{},mx=-1;
   string x;
   map<string,int>mp;
   cin>>n;
   for(int i=0;i<n;i++){
        cin>>x;
        mp[x]++;
   }
   for(auto i:mp)mx=max(mx,i.second);
   cout<<mx;
}


Comments

Submit
0 Comments
More Questions

1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing
1649B - Game of Ball Passing
572A - Arrays
1455A - Strange Functions
1566B - MIN-MEX Cut
678C - Joty and Chocolate
1352E - Special Elements
1520E - Arranging The Sheep
1157E - Minimum Array
1661D - Progressions Covering
262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment
75A - Life Without Zeros
1519A - Red and Blue Beans
466A - Cheap Travel
659E - New Reform
1385B - Restore the Permutation by Merger
706A - Beru-taxi
686A - Free Ice Cream
1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals